Pure point measures with sparse support and sparse Fourier–Bohr support

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Support Vector Machines

Support Vector Machines (SVMs) are state-of-the-art algorithms for classification in machine learning. However, the SVM formulation does not directly seek to find sparse solutions. In this work, we propose an alternate formulation that explicitly imposes sparsity. We show that the proposed technique is related to the standard SVM formulation and therefore shares similar theoretical guarantees. ...

متن کامل

Support Recovery for Sparse Deconvolution of Positive Measures

We study sparse spikes deconvolution over the space of Radon measures when the input measure is a finite sum of positive Dirac masses using the BLASSO convex program. We focus on the recovery properties of the support and the amplitudes of the initial measure in the presence of noise as a function of the minimum separation t of the input measure (the minimum distance between two spikes). We sho...

متن کامل

Sparse Support Recovery with Phase-Only Measurements

Sparse support recovery (SSR) is an important part of the compressive sensing (CS). Most of the current SSR methods are with the full information measurements. But in practice the amplitude part of the measurements may be seriously destroyed. The corrupted measurements mismatch the current SSR algorithms, which leads to serious performance degeneration. This paper considers the problem of SSR w...

متن کامل

Sparse Recovery with Partial Support Knowledge

The goal of sparse recovery is to recover the (approximately) best k-sparse approximation x̂ of an n-dimensional vector x from linear measurements Ax of x. We consider a variant of the problem which takes into account partial knowledge about the signal. In particular, we focus on the scenario where, after the measurements are taken, we are given a set S of size s that is supposed to contain most...

متن کامل

Sampling of Sparse Channels with Common Support

The present paper proposes and studies an algorithm to estimate channels with a sparse common support (SCS). It is a generalization of the classical sampling of signals with Finite Rate of Innovation (FRI) [1] and thus called SCS-FRI. It is applicable to OFDM and WalshHadamard coded (CDMA downlink) communications since SCS-FRI is shown to work not only on contiguous DFT pilots but also uniforml...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the London Mathematical Society

سال: 2020

ISSN: 2052-4986,2052-4986

DOI: 10.1112/tlm3.12020